Welcome![Sign In][Sign Up]
Location:
Search - c Josephus

Search list

[OtherAlgorithm

Description: c++经典小程序。包括河内塔 费式数列 巴斯卡三角形 三色棋 老鼠走迷官(一) 老鼠走迷官(二) 骑士走棋盘 八个皇后 八枚银币 生命游戏 字串核对 双色、三色河内塔 背包问题(Knapsack Problem) 数、运算 蒙地卡罗法求 PI Eratosthenes筛选求质数 超长整数运算(大数运算) 长 PI 最大公因数、最小公倍数、因式分解 完美数 阿姆斯壮数 最大访客数 中序式转后序式(前序式) 后序式的运算 关于赌博 洗扑克牌(乱数排列) Craps赌博游戏 约瑟夫问题(Josephus Problem) 集合问题 排列组合 格雷码(Gray Code) 产生可能的集合 m元素集合的n个元素子集 数字拆解 排序 得分排行 选择、插入、气泡排序 Shell 排序法 - 改良的插入排序 Shaker 排序法 - 改良的气泡排序 Heap 排序法 - 改良的选择排序 快速排序法等 -err
Platform: | Size: 450560 | Author: sunny | Hits:

[Data structsysfh

Description: 用单循环链表编写的约瑟夫环,应用c语言编写-Josephus MADE BY C
Platform: | Size: 4096 | Author: john | Hits:

[VC/MFCclassicsinC

Description: C语言里面的经典算法,包括有老掉牙 河内塔 费式数列 巴斯卡三角形 三色棋 老鼠走迷官(一) 老鼠走迷官(二) 骑士走棋盘 八个皇后 八枚银币 生命游戏 字串核对 双色、三色河内塔 背包问题(Knapsack Problem) 数、运算 蒙地卡罗法求 PI Eratosthenes筛选求质数 超长整数运算(大数运算) 长 PI 最大公因数、最小公倍数、因式分解 完美数 阿姆斯壮数 最大访客数 中序式转后序式(前序式) 后序式的运算 关于赌博 洗扑克牌(乱数排列) Craps赌博游戏 约瑟夫问题(Josephus Problem) 集合问题 排列组合 格雷码(Gray Code) 产生可能的集合 m元素集合的n个元素子集 数字拆解 排序 得分排行 选择、插入、气泡排序 Shell 排序法 - 改良的插入排序 Shaker 排序法 - 改良的气泡排序 Heap 排序法 - 改良的选择排序 快速排序法(一) 快速排序法(二) 快速排序法(三) 合并排序法 基数排序法 搜寻 循序搜寻法(使用卫兵) 二分搜寻法(搜寻原则的代表) 插补搜寻法 费氏搜寻法 矩阵 稀疏矩阵 多维矩阵转一维矩阵 上三角、下三角、对称矩阵 奇数魔方阵 4N 魔方阵 2(2N+1) 魔方阵 -Obsolete Hanoi Tower Fei-style series Pascal triangle Three-color Chess Mouse walking fans Officer (1) Mouse walking fans Officer (2) Knight walking board 8 Queens 8 coins Game of Life String matching Two-color, three-color Hanoi Tower Knapsack problem (Knapsack Problem) The number of operations Monte Carlo method seeking PI Eratosthenes prime number screened seeking Long integer arithmetic (operations of large numbers) Long PI Greatest common factor, least common multiple, factorization Perfect Number 阿姆斯壮数 Maximum number of visitors Type in order to switch the order of type (pre-order type) Follow-style computing About Gambling Wash cards (random order) Craps Casino Games Joseph problems (Josephus Problem) Set problem Permutations Gray code (Gray Code) Generate the set of possible m elements of the collection a subset of n elements Digital dismantling Sort Score Ranking Selection, insertion, bubble sort Shell
Platform: | Size: 441344 | Author: neoleo | Hits:

[STLlist2

Description: 是STL中双向循环链表list的经典应用,面向对象的标准C++语法解决了josephus圈的问题,适合学习数据结构中stl中list的应用,需要面向对象的C++知识。-A concise aplication of "list" in STL, simple but powful.
Platform: | Size: 1024 | Author: 王涛 | Hits:

[AlgorithmJosephus_problem

Description: 自己编写的Josephus问题的求解方法,用C语言采用数组方式实现,个人认为比教科书上提供的方法要精简的多,和大家一起分享-I have written Josephus problem solving method, using C language using an array of ways to achieve, personally think that way than the provision of textbooks to be streamlined and more to share with everyone
Platform: | Size: 887808 | Author: weiw | Hits:

[Data structsJosephuss-Problem

Description: This Josephus s Problem it is make a Visual C++ -This is Josephus s Problem it is make a Visual C++
Platform: | Size: 99328 | Author: Starfaith | Hits:

[Data structsJosephussecond

Description: 数据结构中约瑟夫算法的链表实现。能够在C/C++的环境下运行。 -Josephus.rar, data structures Joseph vector algorithm implementation. To the C/C++ environment to run.
Platform: | Size: 1024 | Author: duyinqinglei | Hits:

[CSharpyesefu

Description: c sharp 程序,算法与结构 yuesefu约瑟夫环,-c sharp program, algorithm and structure yuesefu Josephus,
Platform: | Size: 25600 | Author: mabble | Hits:

[Data structsjeoph

Description: 约瑟夫(Joeph)问题的一种描述是:编号为1,2,…,n的n个人按顺时针方向围坐一圈, 每人持有一个密码(正整数)。一开始任选一个正整数作为报数上限值m,从第一个人开始按顺时针方向自1开始顺序报数,报到m时停止报数。报m的人出列,将他的密码作为新的m值,从他在顺时针方向上的下一个人开始重新从1报数,如此下去,直至所有人全部出列为止。试设计一个程序求出出列顺序。-C language linked list data agencies to achieve Josephus problem. n individuals form a circle, each person has a few, began to report the number, the number to that person out and began to report the number to his number. . .
Platform: | Size: 92160 | Author: | Hits:

[Data structsJoseph

Description: C++语言实现约瑟夫环的求解,采用链表实现环的存储,注释很详细-C++ language Josephus solving
Platform: | Size: 916480 | Author: 桂柯易 | Hits:

[Data structsdead-or-live

Description: 生死者游戏,利用约瑟夫环编写的C语言代码-Game of life and death were the use of Josephus written in C language code
Platform: | Size: 156672 | Author: xia | Hits:

[Data structsyuesefu

Description: 约瑟夫环的c++语言解决代码,visualc++6.0编译成功-Josephus' s c++ language with code, visualc++6.0 build success
Platform: | Size: 1024 | Author: 123 | Hits:

[Data structsJoseph-ring-on-vs-2011

Description: C++链表解决约瑟夫环问题,问题描述:假设有N个小孩按照序号1,2,,,N围坐成一圈,从第一个小孩开始报数,每次报到n的人退出,接着从下一个人重新开始从1开始报数,下一次再报到n的人退出, 求最后一个留下第几个人;-C++ linked list to solve the problem Josephus, described the problem: Suppose there are N children according to number 1,2,,, N sitting in a circle, starting from the first child reported that the number of people out of every report of n, then from the next to re-start from 1 reported that the number, n, the next person and then report out, seeking the last to leave the first few people
Platform: | Size: 5040128 | Author: 沈宙 | Hits:

[Data structsrecycle

Description: 用c语言写的循环链表的约瑟夫环的问题,报数出队的操作-With c language of Josephus circular linked list problem, reported that the number of teams operating
Platform: | Size: 1024 | Author: urge | Hits:

[Data structs0

Description: 约瑟夫环问题,在C语言开发案例中有介绍 个人有相对简便的方法。-Josephus problem, in the C language development are described in individual cases have a relatively easy way.
Platform: | Size: 2048 | Author: 占吉翔 | Hits:

[Data structsC_arithmetic_confluence

Description: 此文件为C算法的集合,里面包含有排序、搜索、穷举、约瑟夫环、八皇后问题的算法,对于编程有很大的参考价值-This document is a collection of C algorithm, which includes sorting, searching, exhaustive, Josephus, the eight queens problem algorithm, the programmer has great reference value
Platform: | Size: 959488 | Author: mcs | Hits:

[Data structsyuesefu

Description: 用c语言开发的来实现约瑟夫环问题的求解程序。-C language development to achieve the Josephus problem solver.
Platform: | Size: 1024 | Author: yjt | Hits:

[Data structsdeadqueen

Description: c语言实现 类似于约瑟夫环的代码 选定一个人最后留下 计算出从谁开始计算-c language code like Josephus .a person selected to stay ,calculate from who is beginning
Platform: | Size: 181248 | Author: xuyu | Hits:

[Data structsjoseph

Description: C语言数据结构课程设计约瑟夫环1. 本演示程序中,人数n应为任意的,首先应输入一个值赋给初始报数上限m,程序应能自动保存出列人的序号和将出列的人所持的密码赋给m,再次作为报数上限,如此循环,直至所有人都出列为止-C language data structures course design Josephus 1. The demonstration program, the number n should be arbitrary, we must first enter a value assigned to Maximum number of initial report m, the program should be able to automatically save a person s number and the column will be a column is assigned a password held by m, the maximum number again as reported, This cycle, until all the columns up
Platform: | Size: 189440 | Author: sharon | Hits:

[Data structsWkechengshejii

Description: 用c或c++编写的八皇后问题,通讯录录,约瑟夫环的代码,数据结构的课程设计 -Write c or c++ for eight queens problem, the code of the address book entries, Josephus, the curriculum design of data structures
Platform: | Size: 8192 | Author: 陪同 | Hits:
« 1 2 3 4 5 6 78 9 10 »

CodeBus www.codebus.net